Reduction strategies in rewriting and programming
نویسندگان
چکیده
منابع مشابه
Editorial Reduction strategies in rewriting and programming
Reduction strategies in rewriting and programming have attracted increasing attention within the last few years. New types of reduction strategy have been invented and investigated, and new results on rewriting/computation under particular strategies have been obtained. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application an...
متن کاملStrategies in Rewriting and Programming
Autowrite is an experimental software tool written in Common Lisp for handling term rewrite systems and bottom-up tree automata. A graphical interface has been written using McCLIM, (the free implementation of the CLIM specification) in order to free the user of any Lisp knowledge. Software and documentation can be found at http://dept-info.labri.u-bordeaux.fr/~idurand/autowrite Autowrite was i...
متن کاملRTA ’ 06 Workshop WRS ’ 06 The Sixth International Workshop on Reduction Strategies in Rewriting and Programming
Plover is an automated property-verifier for Haskell programs that has been under development for the past three years as a component of the Programatica project. In Programatica, predicate definitions and property assertions written in P-logic, a programming logic for Haskell, can be embedded in the text of a Haskell program module. P-logic properties refine the type system of Haskell but cann...
متن کاملWRS 2008 Reduction Strategies in Rewriting and Programming 8 th International Workshop
In this paper we discuss and compare abstract machines for the lambda-calculus, implementing various evaluation strategies. Starting from the well-known Categorical abstract machine (CAM) and Krivine’s abstract machine (KAM), we develop two families of machines that differ in the way they treat environments. The first family is inspired by the work on closed reduction strategies, whereas the se...
متن کاملReduction Strategies for Declarative Programming
This paper surveys reduction or evaluation strategies for functional and functional logic programs. Reasonable reduction strategies for declarative languages must be efficiently implementable to be useful in practice. On the other hand, they should also support the programmers to write programs in a declarative way ignoring the influence of the evaluation strategy to the success of a computatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2005
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2004.12.006